Path selection algorithm for shortest path bridging in access networks
نویسندگان
چکیده
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملalgorithms for biobjective shortest path problems in fuzzy networks
we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملGenetic Algorithm for Shortest Path in Packet Switching Networks
The problem of finding the shortest path between two nodes is a well known problem in network analysis. Optimal routing has been widely studied for interconnection networks this paper considers the problem of finding the shortest path. A Genetic algorithm based strategy is proposed and the algorithm has been developed to find the shortest (Optimal) Path Variable-length chromosomes (strings) and...
متن کاملInverse shortest path algorithms in protected UMTS access networks
In this paper, the application questions of OSPF (Open Shortest Path First) routing protocols in the all–IP based protected UMTS (Universal Mobile Telecommunications System) access networks is investigated. The basic problem here is how the OSPF administrative weights should be adjusted in an adequate way, resulting near–optimal overall network performance both in nominal network operation and ...
متن کاملModified Dijkstra’s Shortest Path Algorithm
Roads play a vital role to the people live in different places and, from day to day, they travel to schools, to work, to shops, and to transport their goods. Even in this modern world, roads remain one of the mediums used most frequently for travel and transportation. The computation of a shortest path between different locations appears to be a key problem in the road networks. The wide range ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Communications Express
سال: 2013
ISSN: 2187-0136
DOI: 10.1587/comex.2.396